# # class Solution:
# #     def findMaxConsecutiveOnes(self, nums: list[int]) -> int:
# #         for i in range(len(nums)):
# #             for n in range(len(nums)-1):
# #                 print(i)
# #                 if nums[n] < nums[n+1]:
# #                     a = nums[n]
# #                     nums[n] = nums[n+1]
# #                     nums[n+1] = a
# #
# #         return nums
# # sy = Solution()
# # li = sy.findMaxConsecutiveOnes(nums=[17,8,6,5,9,8,8,8,10,23])
# # print(li)
# class maxnum:
#     def findcount(self, nums:list[int]):
#         count=0
#         maxcount=0
#         for i in range(len(nums)):
#             if nums[i]==1:
#                 count+=1
#                 maxcount=max(maxcount,count)
#             else:
#                 count=0
#         return maxcount
# test = maxnum()
# print(test.findcount([1,1,1,1,1,1,1,1,0,0,0,0,0,0,1]))
#
# set1={1,2,3}
# set1.add('p')
# set1.add('o')
# print(set1)
class test:
    def paixutest(self, num: list[int]):
        print(max(num))
        for i in range(0, len(num)):
            for j in range(0, len(num)-1):
                if num[j] >= num[i]:
                    a = num[i]
                    num[i] = num[j]
                    num[j] = a
                    print(max(num))

        return num
yftest= test()
print(yftest.paixutest([10, 87, 67, 5, 45, 65, 6, 77, 4, 100, 50, 77,99.5]))

